Fork-Join program response time on multiprocessors with exchangeable join
نویسندگان
چکیده
منابع مشابه
Fork-Join Program Response Time on Multiprocessors with Exchangeable Join
A Fork-Join program is one that consist of k ≥ 1 parallel tasks, which is a reasonable model for a large number of computing applications. When the parallel processor have multi-channels, later arrived tasks may finish executions earlier than the early arrived tasks and may join with the finished tasks from different programs. This phenomenon introduce correlation to tasks service times and is ...
متن کاملResponse Time Approximations in Fork-Join Queues
Fork-join queueing networks model a network of parallel servers in which an arriving job splits into a number of subtasks that are serviced in parallel. Fork-join queues can be used to model disk arrays. A response time approximation of the fork-join queue is presented that attempts to comply with the additional constraints of modelling a disk array. This approximation is compared with existing...
متن کاملResponse Time Analysis of Two Server Fork-Join Systems
This paper gives an exact analysis of mean response time of fork-join systems. The response time is shown to be the sum of parallel wait and parallel service times which are analogous to wait and service times in non-parallel systems. It is shown that the parallel service time of a job is dependent on the state at arrival time of the job. A formal parallel wait time analysis, similar to the wai...
متن کاملResponse-Time Analysis of Fork/Join Tasks in Multiprocessor Systems
This paper proposes a model to analyse the response-time of parallel real-time tasks. The presented model is based on the fork/join model which is internally used by userlevel frameworks to exploit the parallelism provided by the underlying architecture. The model considers tasks with fixed priorities and allows real-time jobs to generate an arbitrary number of parallel threads. Each parallel t...
متن کاملResponse Time Analysis of Distributed File System Based on Fork - join Queue Model ⋆
Application performance is criterion for distributed storage system evaluation, and hence the specific task of system configuration and performance tuning for these application is of great interest. The effectiveness of automatic storage management depends on the accuracy of the storage performance models that are used for making resource optimization configuration. Distributed file system play...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Zhejiang University-SCIENCE A
سال: 2006
ISSN: 1673-565X,1862-1775
DOI: 10.1631/jzus.2006.a0927